Approximating selection differentials and variances for correlated selection indices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selection differentials and selection coefficients.

Proof is offered that s approximately ig for all forms of selection where fitness is a nondecreasing function of a normally distributed phenotype (called fitness potential); s is selection coefficient, i is standard selection differential, and g is standard differential effect of a locus genotype.Evidence is presented that the cost of selection does not limit genic polymorphism; that truncation...

متن کامل

Selection and mortality differentials.

The Office of Population Censuses and Surveys Longitudinal Study provides reliable mortality data by a much wider range of characteristics than are available for other national sources. Although it is based on only a 1% sample of the population, it broadens the scope of mortality analysis and permits study of changes in relationships using different aspects of the time dimension. Data from this...

متن کامل

Simple and Constrained Selection Indices with and without Calving Interval Included in Selection Goal Function for Holstein Cows of Iran

Two selection goals of inclusion or exclusion of calving interval (CI) in the selection goal function for Holstein cows in Iran, besides milk yield, milk fat percentage, and milk protein percentage, were studied. Four selection indices were composed of using the information on production traits, CI and / or days from calving to first insemination (DFI). The results of the predicted genetic grow...

متن کامل

Learning Indices for Schema Selection

In addition to learning new knowledge, a system must be able to learn when the knowledge is likely to be applicable. An index is a piece of information which, when identiied in a given situation, triggers the relevant piece of knowledge (or schema) in the system's memory. We discuss the issue of how indices may be learned automatically in the context of a story understanding task, and present a...

متن کامل

On Approximating Target Set Selection

We study the Target Set Selection (TSS) problem introduced by Kempe, Kleinberg, and Tardos (2003). This problem models the propagation of influence in a network, in a sequence of rounds. A set of nodes is made “active” initially. In each subsequent round, a vertex is activated if at least a certain number of its neighbors are (already) active. In the minimization version, the goal is to activat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Genetics Selection Evolution

سال: 1995

ISSN: 1297-9686

DOI: 10.1186/1297-9686-27-6-551